Metric regularity of semi-infinite constraint systems

نویسندگان

  • María J. Cánovas
  • Asen L. Dontchev
  • Marco A. López
  • Juan Parra
چکیده

We obtain a formula for the modulus of metric regularity of a mapping defined by a semi-infinite system of equalities and inequalities. Based on this formula, we prove a theorem of Eckart-Young type for such set-valued infinite-dimensional mappings: given a metrically regular mapping F of this kind, the infimum of the norm of a linear function g such that F + g is not metrically regular is equal to the reciprocal to the modulus of regularity of F . The Lyusternik-Graves theorem gives a straightforward extension of these results to nonlinear systems. We also discuss the distance to infeasibility for semi-infinite linear inequality systems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Metric Regularity in Convex Semi-Infinite Optimization under Canonical Perturbations

This paper is concerned with the Lipschitzian behavior of the optimal set of convex semi-infinite optimization problems under continuous perturbations of the right hand side of the constraints and linear perturbations of the objective function. In this framework we provide a sufficient condition for the metric regularity of the inverse of the optimal set mapping. This condition consists of the ...

متن کامل

Convex Generalized Semi-Infinite Programming Problems with Constraint Sets: Necessary Conditions

 We consider generalized semi-infinite programming problems in which the index set of the inequality constraints depends on the decision vector and all emerging functions are assumed to be convex. Considering a lower level constraint qualification, we derive a formula for estimating the subdifferential of the value function. Finally, we establish the Fritz-John necessary optimality con...

متن کامل

A General Scalar-Valued Gap Function for Nonsmooth Multiobjective Semi-Infinite Programming

For a nonsmooth multiobjective mathematical programming problem governed by infinitely many constraints‎, ‎we define a new gap function that generalizes the definitions of this concept in other articles‎. ‎Then‎, ‎we characterize the efficient‎, ‎weakly efficient‎, ‎and properly efficient solutions of the problem utilizing this new gap function‎. ‎Our results are based on $(Phi,rho)-$invexity‎,...

متن کامل

Non-Lipschitz Semi-Infinite Optimization Problems Involving Local Cone Approximation

In this paper we study the nonsmooth semi-infinite programming problem with inequality constraints. First, we consider the notions of local cone approximation $Lambda$ and $Lambda$-subdifferential. Then, we derive the Karush-Kuhn-Tucker optimality conditions under the Abadie and the Guignard constraint qualifications.

متن کامل

On Directional Metric Regularity, Subregularity and Optimality Conditions for Nonsmooth Mathematical Programs

This paper mainly deals with the study of directional versions of metric regularity and metric subregularity for general set-valued mappings between infinite-dimensional spaces. Using advanced techniques of variational analysis and generalized differentiation, we derive necessary and sufficient conditions, which extend even the known result for to the conventional metric regularity. Finally, th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Math. Program.

دوره 104  شماره 

صفحات  -

تاریخ انتشار 2005